Direct methods and ADI-preconditioned Krylov subspace methods for generalized Lyapunov equations
نویسنده
چکیده
We consider linear matrix equations where the linear mapping is the sum of a standard Lyapunov operator and a positive operator. These equations play a role in the context of stochastic or bilinear control systems. To solve them efficiently one can fall back on known efficient methods developed for standard Lyapunov equations. In the present paper we describe a direct and an iterative method based on this idea. The direct method is applicable if the generalized Lyapunov operator is a lowrank perturbation of a standard Lyapunov operator; it is related to the Sherman-Morrison-Woodbury formula. The iterative method requires a stability assumption; it uses convergent regular splittings, an ADI-iteration as preconditioner, and Krylov subspace methods. Copyright c © 2000 John Wiley & Sons, Ltd.
منابع مشابه
Solving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملComparison of some Preconditioned Krylov Methods for Solving Sparse Non-symmetric Linear Systems of Equations
Large sparse non-symmetric linear systems of equations often occur in many scientific and engineering applications. In this paper, we present a comparative study of some preconditioned Krylov iterative methods, namely CGS, Bi-CGSTAB, TFQMR and GMRES for solving such systems. To demonstrate their efficiency, we test and compare the numerical implementations of these methods on five numerical exa...
متن کاملEvaluation of Preconditioned Krylov Subspace Methods for Navier-stokes Equations
The purpose of this work is to compare the performance of some preconditioned iterative methods for solving the linear systems of equations, formed at each time-integration step of two-dimensional incompressible NavierStokes equations of fluid flow. The Navier-Stokes equations are discretized in an implicit and upwind control volume formulation. The iterative methods used in this paper include ...
متن کاملOn the ADI method for the Sylvester Equation and the optimal-$\mathcal{H}_2$ points
The ADI iteration is closely related to the rational Krylov projection methods for constructing low rank approximations to the solution of Sylvester equation. In this paper we show that the ADI and rational Krylov approximations are in fact equivalent when a special choice of shifts are employed in both methods. We will call these shifts pseudo H2-optimal shifts. These shifts are also optimal i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008